Scattering theory for graphs isomorphic to a homogeneous tree at infinity
نویسندگان
چکیده
We describe the spectral theory of the adjacency operator of a graph which is isomorphic to a regular tree at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the adjacency operator on a regular tree. We develop this scattering theory using the classical recipes for Schrödinger operators in Euclidian spaces.
منابع مشابه
Spectral and Scattering Theory for Symbolic Potentials of Order Zero
The spectral and scattering theory is investigated for a generalization, to scattering metrics on two-dimensional compact manifolds with boundary, of the class of smooth potentials on R which are homogeneous of degree zero near infinity. The most complete results require the additional assumption that the restriction of the potential to the circle(s) at infinity be Morse. Generalized eigenfunct...
متن کاملSpectral and Scattering Theory for Symbolic Potentials of Order Zero, I
The spectral and scattering theory for a generalization of the class of smooth potentials on R2 which are homogeneous of degree zero near infinity is investigated under the assumption that the restriction to the sphere at infinity is Morse. Generalized eigenfunctions associated to the essential spectrum at non-critical energies are shown to originate both at minima and maxima, altough the latte...
متن کاملOn Inverse Scattering at a Fixed Energy for Potentials with a Regular Behaviour at Infinity
We study the inverse scattering problem for electric potentials and magnetic fields in R, d ≥ 3, that are asymptotic sums of homogeneous terms at infinity. The main result is that all these terms can be uniquely reconstructed from the singularities in the forward direction of the scattering amplitude at some positive energy.
متن کاملThe Tree of Trees: on methods for finding all non-isomorphic tree-realizations of degree sequences
A degree sequence for a graph is a list of positive integers, one for every vertex, where each integer corresponds to the number of neighbors of that vertex. It is possible to create sequences that have no corresponding graphs, as well as sequences that correspond to multiple distinct (i.e., non-isomorphic) graphs. A graph that corresponds to a given degree sequence is called a realization of t...
متن کاملDecomposing highly edge-connected graphs into homomorphic copies of a fixed tree
The Tree Decomposition Conjecture by Barát and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . So far this conjecture has only been verified for paths, stars, and a family of bistars. We prove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013